Self-Supervised Convolutional Subspace Clustering Network with the Block Diagonal Regularizer
نویسندگان
چکیده
The practical visual data do not necessarily lie in linear subspaces, so deep convolutional subspace clustering network is proposed to segment the into multiple categories accurately. original contains stacked encoder module, decoder module and self-expression module. We firstly alter i.e., add a new k-block diagonal regularizer weights of It means that $$\ell _1$$ or _2$$ abandoned. directly pursue block matrix, introducing this will make learned representation matrix conform with better. Secondly, we spectral network, which result used supervise learning matrix. This structured introduced further refines Experimental results on three challenging datasets have demonstrated based method achieves better effect over state-of-the-arts.
منابع مشابه
A Generative Block-Diagonal Model for Clustering
Probabilistic mixture models are among the most important clustering methods. These models assume that the feature vectors of the samples can be described by a mixture of several components. Each of these components follows a distribution of a certain form. In recent years, there has been an increasing amount of interest and work in similarity-matrix-based methods. Rather than considering the f...
متن کاملFeature Selection based Semi-Supervised Subspace Clustering
Clustering is the process which is used to assign a set of n objects into clusters(groups). Dimensionality reduction techniques help in increasing the accuracy of clustering results by removing redundant and irrelevant dimensions. But, in most of the situations, objects can be related in different ways in different subsets of the dimensions. Dimensionality reduction tends to get rid of such rel...
متن کاملA Self-Training Subspace Clustering
Accurate identification of the cancer types is essential to cancer diagnoses and treatments. Since cancer tissue and normal tissue have different gene expression, gene expression data can be used as an efficient feature source for cancer classification. However, accurate cancer classification directly using original gene expression profiles remains challenging due to the intrinsic high-dimensio...
متن کاملTraining recurrent network with block-diagonal approximated Levenberg-Marquardt algorithm
In this paper, we propose the block-diagonal matrix to approximate the Hessian matrix in the Levenberg Mar-quardt method in the training of neural networks. Two weight updating strategies, namely asynchronous and synchronous updating methods were investigated. Asyn-chronous method updates weights of one block at a time while synchronous method updates all weights at the same time. Variations of...
متن کاملMulti-label ASRS Dataset Classification Using Semi Supervised Subspace Clustering
There has been a lot of research targeting text classification. Many of them focus on a particular characteristic of text data multi-labelity. This arises due to the fact that a document may be associated with multiple classes at the same time. The consequence of such a characteristic is the low performance of traditional binary or multi-class classification techniques on multi-label text data....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Processing Letters
سال: 2021
ISSN: ['1573-773X', '1370-4621']
DOI: https://doi.org/10.1007/s11063-021-10563-1